A New Weight Balanced Binary Search Tree 1
نویسنده
چکیده
We develop a new class of weight balanced binary search trees called-balanced binary search trees (-BBSTs).-BBSTs are designed to have reduced internal path length. As a result, they are expected to exhibit good search time characteristics. Individual search, insert, and delete operations in an n node-BBST take O(log n) time for 0 < p 2?1. Experimental results comparing the performance of-BBSTs, WB() trees, AVL-trees, red/black trees, treaps, deterministic skip lists and skip lists are presented. Two simpliied versions of-BBSTs are also developed.
منابع مشابه
New Combinatorial Properties and Algorithms for AVL Trees
In this thesis, new properties of AVL trees and a new partitioning of binary search trees named core partitioning scheme are discussed, this scheme is applied to three binary search trees namely AVL trees, weight-balanced trees, and plain binary search trees. We introduce the core partitioning scheme, which maintains a balanced search tree as a dynamic collection of complete balanced binary tre...
متن کاملConnecting Yule Process, Bisection and Binary Search Tree via Martingales
We present new links between some remarkable martingales found in the study of the Binary Search Tree or of the bisection problem, looking at them on the probability space of a continuous time binary branching process.
متن کاملGeneral Balanced Trees
We show that, in order to achieve efficient maintenance of a balanced binary search tree, no shape restriction other than a logarithmic height is required. The obtained class of trees, general balanced trees, may be maintained at a logarithmic amortized cost with no balance information stored in the nodes. Thus, in the case when amortized bounds are sufficient, there is no need for sophisticate...
متن کاملBounds for Weight Balanced Trees
It has been shown that the cost W of a weight balanced binary tree satisfies the inequalities, H 5 W 5 H + 3, where H is the entropy of the set of the leaves. For a class of “smooth” distributions the inequalities, H 5 W 5 H + 2, are derived. These results imply that for sets with large entropy the search times provided by such trees cannot be substantially shortened when binary decisions are b...
متن کامل